Message Passing in Clusters using Fuzzy Density based Clustering
نویسندگان
چکیده
منابع مشابه
Evolutionary Clustering via Message Passing
When data are acquired at multiple points in time, evolutionary clustering can provide insights into cluster evolution and changes in cluster memberships while enabling performance superior to that obtained by independently clustering data collected at different time points. Existing evolutionary clustering methods typically require additional steps before and after the clustering stage to appr...
متن کاملLow-Latency Message Passing on Workstation Clusters using SCRAMNet
Clusters of workstations have emerged as a popular platform for parallel and distributed computing. Commodity high speed networks which are used to connect workstation clusters provide high bandwidth, but also have high latency. SCRAMNet is an extremely low latency replicated non-coherent shared memory network, so far used only for real-time applications. This paper reports our early experience...
متن کاملParallel Evolutionary Algorithms on Message-Passing Clusters
Parallel Evolutionary algorithms have been developed to reduce the running time of serial Evolutionary algorithms. Two major paradigms for parallel programming, Message Passing and Shared Memory, are implemented and their performance observed. Message Passing Interface (MPI) and TreadMarks runtime libraries are chosen to implement parallel Evolutionary algorithms, based on a synchronous master-...
متن کاملWeighted Community Detection and Data Clustering Using Message Passing
Cheng Shi, Yanchen Liu and Pan Zhang3∗ CompleX Lab, Web Sciences Center, University of Electronic Science and Technology of China, Chengdu 611731, Peoples Republic of China Network Science Institute, Northeastern University, 177 Huntington Avenue, Boston, MA, 02115, United States of America CAS key laboratory of theoretical physics, Institute of Theoretical Physics, Chinese Academy of Sciences,...
متن کاملClustering and Reassignment-Based Mapping Strategy for Message Passing Architectures
A fundamental issue affecting the performance of a parallel program is the assignment of tasks to processors in order to get the minimum completion time. In this paper, we present a compilation-time two-stage mapping strategy (denoted as CREMA) used for mapping arbitrary programs (modeled as TIG graphs) onto message-passing parallel systems with any architecture. In contrast to most of the othe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indian Journal of Science and Technology
سال: 2015
ISSN: 0974-5645,0974-6846
DOI: 10.17485/ijst/2015/v8i16/61761